Exploring the Monodic Fragment of First-Order Temporal Logic using Clausal Temporal Resolution
نویسندگان
چکیده
Until recently, first-order temporal logic has been little understood. While it is well known that the full logic has no finite axiomatisation, a more detailed analysis of fragments of the logic was not available. However, a breakthrough by Hodkinson et.al., identifying a finitely axiomatisable fragment, termed the monodic fragment, has led to improved understanding of first-order temporal logic. Following this result, the clausal temporal resolution technique, originally developed for propositional temporal logics, has been extended to such monodic fragments. While this is useful as a practical proof technique for certain monodic classes, in this paper we show that the use of clausal temporal resolution provides us with increased understanding of the monodic fragment. In particular, several features of monodic first-order temporal logic are established as corollaries of the completeness result for the clausal temporal resolution method. These include definitions of new decidable monodic classes, simplification of existing monodic classes by reductions, an extension of finite axiomatisability beyond the monodic fragment.
منابع مشابه
Handling Equality in Monodic Temporal Resolution
First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments including the guarded fragment with equality. In this paper, we specialise the monodic reso...
متن کاملTowards First-Order Temporal Resolution
In this paper we show how to extend clausal temporal resolution to the ground eventuality fragment of monodic first-order temporal logic, which has recently been introduced by Hodkinson, Wolter and Zakharyaschev. While a finite Hilbert-like axiomatization of complete monodic first order temporal logic was developed by Wolter and Zakharyaschev, we propose a temporal resolutionbased proof system ...
متن کاملMonodic Temporal Resolution: the Expanding Domain Case
Temporal Logic has achieved a significant role in Computer Science, in particular, within the formal specification and verification of concurrent and distributed systems [13, 11, 10]. However, even though first-order temporal logics have been studied over a number of years and have been recognised as a concise and powerful formalism, most of the temporal logics used remain essentially propositi...
متن کاملTowards the Implementation of First-Order Temporal Resolution: the Expanding Domain Case
First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments. In this paper, we develop a clausal resolution method for the monodic fragment of first-or...
متن کاملMonodic ASMs and Temporal Verification
In this paper, we pursue the goal of automatic deductive verification for certain classes of ASM. In particular, we base our work on a translation of general ASMs to full first-order temporal logic. While such a logic is, in general, not finitely axiomatisable, recent work has identified a fragment, termed the monodic fragment, that is finitely axiomatisable and many of its subfragments are dec...
متن کامل